A Gessel–Viennot-Type Method for Cycle Systems in a Directed Graph
نویسندگان
چکیده
منابع مشابه
A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph
We introduce a new determinantal method to count cycle systems in a directed graph that generalizes Gessel and Viennot’s determinantal method on path systems. The method gives new insight into the enumeration of domino tilings of Aztec diamonds, Aztec pillows, and related regions.
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولa cauchy-schwarz type inequality for fuzzy integrals
نامساوی کوشی-شوارتز در حالت کلاسیک در فضای اندازه فازی برقرار نمی باشد اما با اعمال شرط هایی در مسئله مانند یکنوا بودن توابع و قرار گرفتن در بازه صفر ویک می توان دو نوع نامساوی کوشی-شوارتز را در فضای اندازه فازی اثبات نمود.
15 صفحه اولA Petri-net Model for Operational Cycle in SCADA Systems
Supervisory control and data acquisition (SCADA) system monitors and controls industrial processes in critical infrastructures (CIs) and plays the vital role in maintaining the reliability of CIs such as power, oil, and gas system. In fact, SCADA system refers to the set of control process, which measures and monitors sensors in remote substations from a control center. These sensors usually ha...
متن کاملTree-type values for cycle-free directed graph games
For arbitrary cycle-free directed graph games tree-type values are introduced axiomatically and their explicit formula representation is provided. These values may be considered as natural extensions of the tree and sink values as has been defined correspondingly for rooted and sink forest graph games. The main property for the tree value is that every player in the game receives the worth of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2006
ISSN: 1077-8926
DOI: 10.37236/1063